Complexity of λ - term reductions
نویسندگان
چکیده
— The complexity ofa X-term is defined as the number of ^-réductions needed to reach its normal form («.ƒ.). In the present paper some gênerai properties of the complexity of applications of n. ƒ s. are stated and this complexity is maximized, in some interesting cases, as a function of parameters describing the structures of the current n.f. s.
منابع مشابه
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus
We study the Church-Rosser property—which is also known as confluence—in term rewriting and λ-calculus. Given a system R and a peak t ∗← s →∗ t′ in R, we are interested in the length of the reductions in the smallest corresponding valley t →∗ s′ ∗← t′ as a function vsR(m,n) of the size m of s and the maximum length n of the reductions in the peak. For confluent term rewriting systems (TRSs), we...
متن کاملNonlocal Symmetries, Telescopic Vector Fields and λ-Symmetries of Ordinary Differential Equations
This paper studies relationships between the order reductions of ordinary differential equations derived by the existence of λ-symmetries, telescopic vector fields and some nonlocal symmetries obtained by embedding the equation in an auxiliary system. The results let us connect such nonlocal symmetries with approaches that had been previously introduced: the exponential vector fields and the λ-...
متن کاملLeast Upper Bounds on the Size of Confluence and Church-Rosser Diagrams in Term Rewriting and λ-Calculus1
We study confluence and the Church-Rosser property in term rewriting and λ-calculus with explicit bounds on term sizes and reduction lengths. Given a system R, we are interested in the lengths of the reductions in the smallest valleys t→∗ s′ ∗← t′ expressed as a function: — for confluence a function vsR(m,n) where the valleys are for peaks t ∗← s→∗ t′ with s of size at most m and the reductions...
متن کاملالگوریتم کنترل نرخ بیت متغیر ویدئو در سطح گروه تصاویر برای استاندارد فشردهسازی H.265
A rate control algorithm at the group of picture (GOP) level is proposed in this paper for variable bit rate applications of the H.265/HEVC video coding standard with buffer constraint. Due to structural changes in the HEVC compared to the previous standards, new rate control algorithms are needed to be designed. In the proposed algorithm, quantization parameter (QP) of each GOP is obtained by ...
متن کاملNormalisation is Insensible to λ-term Identity or Difference
This paper analyses the computational behaviour of λterm applications. The properties we are interested in are weak normalisation (i.e. there is a terminating reduction) and strong normalisation (i.e. all reductions are terminating). One can prove that the application of a λ-term M to a fixed number n of copies of the same arbitrary strongly normalising λ-term is strongly normalising if and onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017